Computation, hypercomputation, and physical science
نویسنده
چکیده
Copeland and others have argued that the Church-Turing thesis (CTT) has been widely misunderstood by philosophers and cognitive scientists. In particular, they have claimed that CTT is in principle compatible with the existence of machines that compute functions above the “Turing limit,” and that empirical investigation is needed to determine the “exact membership” of the set of functions that are physically computable. I argue for the following points: (a) It is highly doubtful that philosophers and cognitive scientists have widely misunderstood CTT as alleged.1 In fact, by and large, computability theorists and mathematical logicians understand CTT in the exact same way. (b) That understanding most likely coincides with what Turing and Church had in mind. Even if it does not, an accurate exegesis of Turing and Church need not dictate how today’s working scientists understand the thesis. (c) Even if we grant Copeland’s reading of CTT, an orthodox stronger version of it which he rejects (Gandy’s thesis) follows readily if we only accept a highly plausible necessary condition for what constitutes a deterministic digital computer. Finally, (d) regardless of whether we accept this condition, the prospects for a scientific theory of hypercomputation are exceedingly poor because physical science does not have the wherewithal to investigate computability or to discover its ultimate “limit.”
منابع مشابه
The case for hypercomputation
The weight of evidence supporting the case for hypercomputation is compelling. We examine some 20 physical and mathematical models of computation that are either known or suspected to have super-Turing or hypercomputational capabilities, and argue that there is nothing in principle to prevent the physical implementation of hypercomputational systems. Hypercomputation may indeed be intrinsic to ...
متن کاملHypercomputation: computing more than the Turing machine
In this report I provide an introduction to the burgeoning field of hypercomputation – the study of machines that can compute more than Turing machines. I take an extensive survey of many of the key concepts in the field, tying together the disparate ideas and presenting them in a structure which allows comparisons of the many approaches and results. To this I add several new results and draw o...
متن کاملWhy there is no such discipline as hypercomputation
The editors have kindly invited me to write an introduction to this special issue devoted to ‘‘hypercomputation’’ despite their perfect awareness of my belief that there is no such subject. In [5], I rather thoroughly debunked the claims of two of the leading proponents of this supposed branch of learning. In this brief introduction I will content myself with some general remarks. The analysis ...
متن کاملPhysical constraints on hypercomputation
“To infinity, and beyond!”, Buzz Lightyear, Toy Story, Pixar, 1995. Many attempts to transcend the fundamental limitations to computability implied by the Halting Problem for Turing Machines depend on the use of forms of hypercomputation that draw on notions of infinite or continuous, as opposed to bounded or discrete, computation. Thus, such schemes may include the deployment of actualised rat...
متن کاملHypercomputation and the Physical Church-Turing Thesis
A version of the Church-Turing Thesis states that every effectively realizable physical system can be defined by Turing Machines (‘Thesis P’); in this formulation the Thesis appears an empirical, more than a logico-mathematical, proposition. We review the main approaches to computation beyond Turing definability (‘hypercomputation’): supertask, non-well-founded, analog, quantum, and retrocausal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Applied Logic
دوره 6 شماره
صفحات -
تاریخ انتشار 2008